Dynamic Shortest Paths Minimizing Travel Times and Costs
نویسندگان
چکیده
منابع مشابه
Dynamic shortest paths minimizing travel times and costs
In this paper, we study dynamic shortest path problems, which is to determine a shortest path from a specified source node to every other node in the network where arc travel times change dynamically. We consider two problems: the minimum time walk problem (which is to find a walk with the minimum travel time) and the minimum cost walk problem (which is to find a walk with the minimum travel co...
متن کاملMIT Sloan School of Management Working Paper 4390 - 02 August 2002 DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS
In this paper, we study dynamic shortest path problems that determine a shortest path from a specified source node to every other node in the network where arc travel times change dynamically. We consider two problems: the minimum time walk problem and the minimum cost walk problem. The minimum time walk problem is to find a walk with the minimum travel time. The minimum cost walk problem is to...
متن کاملContinuous-time Dynamic Shortest Paths with Negative Transit Times
We consider the dynamic shortest path problem in the continuous-time model because of its importance. This problem has been extensively studied in the literature. But so far, all contributions to this problem are based on the assumption that all transit times are strictly positive. However, in order to study dynamic network flows it is essential to support negative transit times since they occu...
متن کاملAverage Update Times for Fully-Dynamic All-Pairs Shortest Paths
We study the fully-dynamic all pairs shortest path problem for graphs with arbitrary non-negative edge weights. It is known for digraphs that an update of the distance matrix costs Õ(n) worst-case time [Thorup, STOC ’05] and Õ(n) amortized time [Demetrescu and Italiano, J.ACM ’04] where n is the number of vertices. We present the first average-case analysis of the undirected problem. For a rand...
متن کاملDynamic Shortest Paths Containers
Using a set of geometric containers to speed up shortest path queries in a weighted graph has been proven a useful tool for dealing with large sparse graphs. Given a layout of a graph G = (V, E), we store, for each edge (u, v) ∈ E, the bounding box of all nodes t ∈ V for which a shortest u-t-path starts with (u, v). Shortest path queries can then be answered by Dijkstra’s algorithm restricted t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2002
ISSN: 1556-5068
DOI: 10.2139/ssrn.344442